func github.com/klauspost/compress/flate.hashLen
42 uses
github.com/klauspost/compress/flate (current package)
fast_encoder.go#L117: func hashLen(u uint64, length, mls uint8) uint32 {
level1.go#L81: nextHash := hashLen(cv, tableBits, hashBytes)
level1.go#L90: nextHash = hashLen(now, tableBits, hashBytes)
level1.go#L204: e.table[hashLen(cv, tableBits, hashBytes)] = tableEntry{offset: s + e.cur}
level1.go#L217: prevHash := hashLen(x, tableBits, hashBytes)
level1.go#L220: currHash := hashLen(x, tableBits, hashBytes)
level2.go#L79: nextHash := hashLen(cv, bTableBits, hashBytes)
level2.go#L88: nextHash = hashLen(now, bTableBits, hashBytes)
level2.go#L160: e.table[hashLen(cv, bTableBits, hashBytes)] = tableEntry{offset: s + e.cur}
level2.go#L168: nextHash := hashLen(x, bTableBits, hashBytes)
level2.go#L172: nextHash = hashLen(x, bTableBits, hashBytes)
level2.go#L176: nextHash = hashLen(x, bTableBits, hashBytes)
level2.go#L188: prevHash := hashLen(x, bTableBits, hashBytes)
level2.go#L189: prevHash2 := hashLen(x>>8, bTableBits, hashBytes)
level2.go#L192: currHash := hashLen(x>>16, bTableBits, hashBytes)
level3.go#L79: nextHash := hashLen(cv, tableBits, hashBytes)
level3.go#L170: nextHash := hashLen(cv, tableBits, hashBytes)
level3.go#L181: nextHash := hashLen(load6432(src, i), tableBits, hashBytes)
level3.go#L189: prevHash := hashLen(x, tableBits, hashBytes)
level3.go#L196: prevHash = hashLen(x, tableBits, hashBytes)
level3.go#L203: currHash := hashLen(x, tableBits, hashBytes)
level4.go#L84: nextHashS := hashLen(cv, tableBits, hashShortBytes)
level4.go#L172: e.table[hashLen(cv, tableBits, hashShortBytes)] = tableEntry{offset: s + e.cur}
level4.go#L187: e.table[hashLen(cv>>8, tableBits, hashShortBytes)] = t2
level4.go#L196: e.table[hashLen(cv>>8, tableBits, hashShortBytes)] = t2
level4.go#L205: prevHashS := hashLen(x, tableBits, hashShortBytes)
level5.go#L92: nextHashS := hashLen(cv, tableBits, hashShortBytes)
level5.go#L109: nextHashS = hashLen(next, tableBits, hashShortBytes)
level5.go#L261: e.table[hashLen(cv, tableBits, hashShortBytes)] = t
level5.go#L274: e.table[hashLen(cv, tableBits, hashShortBytes)] = t
level5.go#L284: e.table[hashLen(cv>>8, tableBits, hashShortBytes)] = t2
level5.go#L293: prevHashS := hashLen(x, tableBits, hashShortBytes)
level5.go#L404: nextHashS := hashLen(cv, tableBits, hashShortBytes)
level5.go#L421: nextHashS = hashLen(next, tableBits, hashShortBytes)
level5.go#L573: e.table[hashLen(cv, tableBits, hashShortBytes)] = t
level5.go#L586: e.table[hashLen(cv, tableBits, hashShortBytes)] = t
level5.go#L596: e.table[hashLen(cv>>8, tableBits, hashShortBytes)] = t2
level5.go#L605: prevHashS := hashLen(x, tableBits, hashShortBytes)
level6.go#L94: nextHashS := hashLen(cv, tableBits, hashShortBytes)
level6.go#L111: nextHashS = hashLen(next, tableBits, hashShortBytes)
level6.go#L290: e.table[hashLen(cv, tableBits, hashShortBytes)] = tableEntry{offset: i + e.cur}
level6.go#L305: e.table[hashLen(cv, tableBits, hashShortBytes)] = t
|
The pages are generated with Golds v0.6.7. (GOOS=linux GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @Go100and1 (reachable from the left QR code) to get the latest news of Golds. |